Under Consideration for Publication in J. Functional Programming Inductive Graphs and Functional Graph Algorithms

We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively deened data types. We show how this graph model can be implemented eeciently, and then we demonstrate how graph algorithms can be succinctly given by recursive function deenitions based on the inductive graph view. We also regard this as a contribution to the teaching of algorithms and data structures in functional languages since we can use the functional-style graph algorithms instead of the imperative algorithms that are dominant today.